Mechanical Verification of Fault Tolerant Architecture in a Prototype Verification System
نویسندگان
چکیده
In this paper, we present an approach to embed our formal Generic Fault Tolerant Software Architecture (GFTSA) model in the PVS theorem prover to achieve automatic verification support for reasoning about fault tolerant system properties. In order to make the verification process more efficient and systematic, we also propose a template approach for the auto-generation of specifications and proof obligations at the customized system level from the GFTSA. By customizing the template, we not only can produce the formal models of specific GFTSA systems in PVS, but also the proofs scripts for the fault tolerant properties of such systems. Based on the produced model and proof scripts, we are able to mechanically verify the fault tolerant properties in a batch mode using ProofLite. A case study of an Electronic Power System (EPS) is presented to illustrate the customization process and mechanical verification.
منابع مشابه
A case-study in component-based mechanical verification of fault-tolerant programs
In this paper, we present a case study to demonstrate that the decomposition of a fault-tolerant program into its components is useful in its mechanical verification. More specifically, we discuss our experience in using the theorem prover PVS to verify Dijkstra’s token ring program in a component-based manner. We also demonstrate the advantages of component based mechanical verification.
متن کاملA Test Generation Framework for Distributed Fault-Tolerant Algorithms
Heavyweight formal methods such as theorem proving have been successfully applied to the analysis of safety critical fault-tolerant systems. Typically, the models and proofs performed during such analysis do not inform the testing process of actual implementations. We propose a framework for generating test vectors from specifications written in the Prototype Verification System (PVS). The meth...
متن کاملA Case-Study in Component-Based Mechanical Verification of Fault-Tolerant Programs1 To appear in Fourth Workshop on Self-Stabilization (WSS’99) Austin, Texas, USA
In this paper, we present a case study to demonstrate that the decomposition of a fault-tolerant program into its components is useful in its mechanical verification. More specifically, we discuss our experience in using the theorem prover PVS to verify Dijkstra’s token ring program in a component-based manner. We also demonstrate the advantages of component based mechanical verification.
متن کاملMechanical Verification of Automatic Synthesis of Fault-Tolerant Programs
Fault-tolerance is a crucial property in many systems. Thus, mechanical verification of algorithms associated with synthesis of faulttolerant programs is desirable to ensure their correctness. In this paper, we present the mechanized verification of algorithms that automate the addition of fault-tolerance to a given fault-intolerant program using the PVS theorem prover. By this verification, no...
متن کاملFormal Verification for Fault-Tolerant Architectures: Prolegomena to the Design of PVS
PVS is the most recent in a series of verification systems developed at SRI. Its design was strongly influenced, and later refined, by our experiences in developing formal specifications and mechanical ly checked verifications for the fault-tolerant architecture, algorithms, and implementations of a model “reliable computing platform” (RCP) for life-critical digital flight-control applications,...
متن کامل